Partial Updates: Exploration
نویسندگان
چکیده
The partial update problem for parallel abstract state machines has manifested itself in the cases of counters, sets and maps. We propose a solution of the problem that lends itself to an eÆcient implementation and covers the three cases mentioned above. There are other cases of the problem that require a more general framework.
منابع مشابه
PAC-optimal, Non-parametric Algorithms and Bounds for Exploration in Concurrent MDPs with Delayed Updates
PAC-optimal, Non-parametric Algorithms and Bounds for Exploration in Concurrent MDPs with Delayed Updates by Jason Pazis Department of Computer Science Duke University Date: Approved: Ronald Parr, Supervisor Vincent Conitzer George Konidaris Mauro Maggioni Peter Stone An abstract of a dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the...
متن کاملPartial Updates Exploration II
During one step of a powerful programming, specification or query language, the same mathematical object, like a set or map or sequence, may be modified – in parallel – by different parts of the program. Such partial updates need to be efficiently checked for consistency and integrated. This is the problem of partial updates in a nutshell. In our first paper on the subject we proposed a general...
متن کاملEfficient PAC-Optimal Exploration in Concurrent, Continuous State MDPs with Delayed Updates
We present a new, efficient PAC optimal exploration algorithm that is able to explore in multiple, continuous or discrete state MDPs simultaneously. Our algorithm does not assume that value function updates can be completed instantaneously, and maintains PAC guarantees in realtime environments. Not only do we extend the applicability of PAC optimal exploration algorithms to new, realistic setti...
متن کاملMonitoring Partial Updates in Web Pages Using Relational Learning
This paper describes an automatic monitoring system that constantly checks partial updates in Web pages and notifies them to a user. While one of the most important advantages of the WWW is frequent updates of Web pages, we need to constantly check them out and this task may take much cognitive load. Unfortunately applications to automatically check such updates can not deal with partial update...
متن کاملPartial updates
A datastructure instance, e.g. a set or file or record, may be modified independently by different parts of a computer system. The modifications may be nested. Such hierarchies of modifications need to be efficiently checked for consistency and integrated. This is the problem of partial updates in a nutshell. In our first paper on the subject, we developed an algebraic framework which allowed u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. UCS
دوره 7 شماره
صفحات -
تاریخ انتشار 2001